#include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 10;
int t, n, a[N];

int main()
{
#ifdef LOCAL
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
#endif
    cin >> t;
    while (t--)
    {
        cin >> n;
        for (int i = 1; i <= n; i++)
            cin >> a[i];
        sort(a + 1, a + 1 + n);
        int ans = 0, min_pos = INT_MAX;
        for (int i = 1; i <= n; i++)
        {
            if (a[i] <= 0)
                ans++;
            else
                min_pos = min(min_pos, a[i]);
        }

        // 有正数
        int flag = 0;
        if (min_pos != INT_MAX)
        {
            flag = 1;
            for (int i = 2; i <= n; i++)
            {
                if (a[i] <= 0 && a[i] - a[i - 1] < min_pos)
                {
                    flag = 0;
                    break;
                }
            }
        }
        cout << ans + flag << endl;
    }
    return 0;
}